Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

IF YOU WANT IT DONE RIGHT,DO IT YOURSELF

Some have argued that the transatlantic rancor over the Iraq war made cooperation, especially on nonproliferation, unlikely. In contrast, this article, documents post-invasion instances of nonproliferation cooperation, with particular emphasis on the Proliferation Security Initiative and the EU-3 Initiative—the British, French, and German negotiations with Iran over its suspected nuclear activities. In addition to documenting French and British participation in these initiatives, the article analyzes why they have chosen to participate and argues that France and Britain have participated in both efforts because they are committed to avoiding future Iraq-like preventive wars.     

Game theory and the Second Iraq War

Throughout the world, there is a large number of young, and even not-so-young, scholars who are reading for higher degrees in strategic, security and defense studies, or engaged in analytical research in research institutes, think-tanks or consultancies; they bring to the subject innovative and fresh perspectives often ignored or missed by more established scholars. Most of these people have yet to make their mark in the defense and security field. The Editors of Defense & Security Analysis are resolved to tap this value source of information, observation, analysis and critical study by offering a new section of the journal for their views to be given an opportunity to be aired. Submissions of up to 3,000 words are encouraged from University Master's and Doctoral candidates and post-doctoral researchers.     

Keeping an eye on South Asian skies: America’s pivotal deterrence in nuclearized India–Pakistan crises

Since declaring their nuclear weapons capabilities in 1998, India and Pakistan have engaged in three major crises that each threatened to escalate into war. In each crisis, the USA engaged in active diplomacy to dissuade the South Asian rivals from taking escalatory actions. Previous literature on the crises has described the American role, but has not theorized third-party involvement in a nuclearized regional rivalry. We apply Timothy Crawford’s pivotal deterrence theory to the nuclearized India–Pakistan conflict, and extend the original theory to cover the novel condition of a non-superpower nuclear dyad, in the context of a single-superpower international system. We find that America’s pivotal deterrence generally enhanced stability in the India–Pakistan crises, and unlike in pre-nuclear South Asia, other great powers supported American diplomacy. However, we suggest that future regional crises between nuclear rivals, in South Asia or elsewhere, may present greater challenges for pivotal deterrence.     

On the exponentially weighted moving variance

MacGregor and Harris (J Quality Technol 25 (1993) 106–118) proposed the exponentially weighted mean squared deviation (EWMS) and the exponentially weighted moving variance (EWMV) charts as ways of monitoring process variability. These two charts are particularly useful for individual observations where no estimate of variability is available from replicates. However, the control charts derived by using the approximate distributions of the EWMS and EWMV statistics are difficult to interpret in terms of the average run length (ARL). Furthermore, both control charting schemes are biased procedures. In this article, we propose two new control charts by applying a normal approximation to the distributions of the logarithms of the weighted sum of chi squared random variables, which are respectively functions of the EWMS and EWMV statistics. These new control charts are easy to interpret in terms of the ARL. On the basis of the simulation studies, we demonstrate that the proposed charts are superior to the EWMS and EWMV charts and they both are nearly unbiased for the commonly used smoothing constants. We also compare the performance of the proposed charts with that of the change point (CP) CUSUM chart of Acosta‐Mejia (1995). The design of the proposed control charts is discussed. An example is also given to illustrate the applicability of the proposed control charts. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009